Network Inference by Learned Node-Specific Degree Prior
نویسندگان
چکیده
Qingming Tang ∗ Toyota Technological Institute at Chicago 6045 S. Kenwood Ave. Chicago, Illinois 60637 [email protected] Lifu Tu ∗ Toyota Technological Institute at Chicago 6045 S. Kenwood Ave. Chicago, IL [email protected] Weiran Wang ∗ Toyota Technological Institute at Chicago 6045 S. Kenwood Ave. Chicago, IL [email protected] Jinbo Xu Toyota Technological Institute at Chicago 6045 S. Kenwood Ave. Chicago, Illinois 60637 [email protected]
منابع مشابه
Learning Scale-Free Networks by Dynamic Node Specific Degree Prior
Learning network structure underlying data is an important problem in machine learning. This paper presents a novel degree prior to study the inference of scale-free networks, which are widely used to model social and biological networks. In particular, this paper formulates scale-free network inference using Gaussian Graphical model (GGM) regularized by a node degree prior. Our degree prior no...
متن کاملLearning Scale Free Network by Node Specific Degree Prior
Learning the network structure underlying data is an important problem in machine learning. This paper introduces a novel prior to study the inference of scale-free networks, which are widely used to model social and biological networks. The prior not only favors a desirable global node degree distribution, but also takes into consideration the relative strength of all the possible edges adjace...
متن کاملExtended Bayesian scores for reconstructing gene regulatory networks
The discovery of regulatory networks is an important aspect in the post genomic research. We compared various scoring criteria in the context of structure learning in Bayesian networks. We show that adding a uniform node in-degree prior helps improve precision without deteriorate sensitivity for typical regulatory networks encountered in prokaryote and eukaryote organisms. Experiments are perfo...
متن کاملA Scale-Free Structure Prior for Graphical Models with Applications in Functional Genomics
The problem of reconstructing large-scale, gene regulatory networks from gene expression data has garnered considerable attention in bioinformatics over the past decade with the graphical modeling paradigm having emerged as a popular framework for inference. Analysis in a full Bayesian setting is contingent upon the assignment of a so-called structure prior-a probability distribution on network...
متن کاملLearning Bayesian Network Structure using Markov Blanket in K2 Algorithm
A Bayesian network is a graphical model that represents a set of random variables and their causal relationship via a Directed Acyclic Graph (DAG). There are basically two methods used for learning Bayesian network: parameter-learning and structure-learning. One of the most effective structure-learning methods is K2 algorithm. Because the performance of the K2 algorithm depends on node...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1602.02386 شماره
صفحات -
تاریخ انتشار 2016